Prevention of Fault Propagation in Web Service: a Complex Network Approach
نویسندگان
چکیده
How to prevent the fault propagation problems in Web Service has become an important issue. The recent research works mostly take some fault tolerance method in service based system. These methods detect or diagnose faults in the composition process, find the failure service, take tolerance action and recover the system. However, in the service oriented architecture, one service is shared by different service based systems. The fault tolerance method only considers from the view of one service user, and tolerance action not considering the whole network would change its load and even the global redistribution of loads over all of the services, trigger a cascade of overload, and result in service network paralysis. The research of cascading failure in Complex Network provides a set of models to help study the above problems. Consequently, this paper proposes a new approach to deal with the fault propagation for Web Service from the view point of the whole service network, which could analyze its resistance influenced by the size of network, different types of attacks and load allocation strategies and prevent the disasters from happening. Firstly, it constructs a Web Service Complex Network (WSCN) composed of single service and their functional similarity. Then it models fault propagation based on WSCN, and simulates the propagation process by analyzing WSCN performance under small attack, large attack, random attack and calculated attack. When fault happens in WSCN, our method uses weight-based and spare-load-based load allocation methods of failed service to compare their influences on the whole network. The experimental results show that when fault happens in WSCN, the network has better resistance for small scale failure than big scale one, and resists stronger for random attack than deliberate one; when the service failure happens, the remaining space based load allocation strategy on it has higher robustness than weight based one. The simulation of fault propagation for Web Service could set example for preventing and reducing probabilities of collapse in the service network.
منابع مشابه
Architectural Plan for Constructing Fault Tolerable Workflow Engines Based on Grid Service
In this paper the design and implementation of fault tolerable architecture for scientific workflow engines is presented. The engines are assumed to be implemented as composite web services. Current architectures for workflow engines do not make any considerations for substituting faulty web services with correct ones at run time. The difficulty is to rollback the execution state of the workflo...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملArchitectural Plan for Constructing Fault Tolerable Workflow Engines Based on Grid Service
In this paper the design and implementation of fault tolerable architecture for scientific workflow engines is presented. The engines are assumed to be implemented as composite web services. Current architectures for workflow engines do not make any considerations for substituting faulty web services with correct ones at run time. The difficulty is to rollback the execution state of the workflo...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Web Eng.
دوره 14 شماره
صفحات -
تاریخ انتشار 2015